Improving Algorithmic Optimisation Method by Spectral Clustering

نویسندگان

  • Radek Silhavy
  • Petr Silhavy
  • Zdenka Prokopova
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Experimental Evaluation of Algorithmic Effort Estimation Models using Projects Clustering

One of the most important aspects of software project management is the estimation of cost and time required for running information system. Therefore, software managers try to carry estimation based on behavior, properties, and project restrictions. Software cost estimation refers to the process of development requirement prediction of software system. Various kinds of effort estimation patter...

متن کامل

New Methods for Spectral Clustering

Analyzing the affinity matrix spectrum is an increasingly popular data clustering method. We propose three new algorithmic components which are appropriate for improving performance of spectral clustering. First, observing the eigenvectors suggests to use a K-lines algorithm instead of the commonly applied K-means. Second, the clustering works best if the affinity matrix has a clear block struc...

متن کامل

Cluster Ensemble Algorithm using the Binary k - means and Spectral Clustering ?

Cluster ensemble has been shown to be an effective thought of improving the accuracy and stability of single clustering algorithms. It consists of generating a set of partition results from a same data set and combining them into a final one. In this paper, we develop a novel cluster ensemble method named Cluster Ensemble algorithm using the Binary k-means and Spectral Clustering (CEBKSC). By u...

متن کامل

Minimum Spectral Connectivity Projection Pursuit for Unsupervised Classification

We study the problem of determining the optimal univariate subspace for maximising the separability of a binary partition of unlabeled data, as measured by spectral graph theory. This is achieved by finding projections which minimise the second eigenvalue of the Laplacian matrices of the projected data, which corresponds to a non-convex, non-smooth optimisation problem. We show that the optimal...

متن کامل

Algorithmic Optimisation Method for Improving Use Case Points Estimation

This paper presents a new size estimation method that can be used to estimate size level for software engineering projects. The Algorithmic Optimisation Method is based on Use Case Points and on Multiple Least Square Regression. The method is derived into three phases. The first phase deals with calculation Use Case Points and correction coefficients values. Correction coefficients are obtained...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017